Open Problems in Logic and Games
نویسنده
چکیده
1 The setting, the purpose, and a warning Dov Gabbay is a prolific logician just by himself. But beyond that, he is quite good at making other people investigate the many further things he cares about. As a result, King’s College London has become a powerful attractor in our field worldwide. Thus, it is a great pleasure to be an organizer for one of its flagship events: the Augustus de Morgan Workshop of 2005. Benedikt Loewe and I proposed the topic of ’interactive logic’ for this occasion, with an emphasis on social software — the logical analysis and design of social procedures — and on games, arguably the formal interactive setting par excellence. This choice reflects current research interests in our logic community at ILLC Amsterdam and beyond. In this broad area of interfaces between logic, computer science, and game theory, this paper is my own attempt at playing Dov. I am, perhaps not telling, but at least asking other people to find out for me what I myself cannot.
منابع مشابه
A Study of the Correlation between Computer Games and Adolescent Behavioral Problems
Background: Today, due to developing communicative technologies, computer games and other audio-visual media as social phenomena, are very attractive and have a great effect on children and adolescents. The increasing popularity of these games among children and adolescents results in the public uncertainties about plausible harmful effects of these games. This study aimed to investigate the co...
متن کاملA review on symmetric games: theory, comparison and applications
Game theory models decision makers' behaviors in strategic situations. Since the structures of games are different, behavior and preferences of the players are different in various types of game. This paper reviews various situations of games. Here, characteristics of some common games are discussed and compared. Specifically, we focus on a group of games called symmetric games including Prison...
متن کاملHardness of Parameterized Resolution
From 07/02/10 to 12/02/10, the Dagstuhl Seminar 10061 Circuits, Logic, and Games was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in thi...
متن کاملThe Complexity of Local Proof Search in Linear Logic
Proof search in linear logic is known to be diicult: the provability of propositional linear logic formulas is undecidable. Even without the modalities, multiplicative-additive fragment of propositional linear logic, mall, is known to be pspace-complete, and the pure multiplicative fragment, mll, is known to be np-complete. However, this still leaves open the possibility that there might be pro...
متن کاملIn Praise of Strategies
This note highlights one major theme in my lecture notes Logic in Games (van Benthem 1999 – 2002): the need for explicit logics that define agents' strategies, as the drivers of interaction in games. Our text outlines issues, recalls published results from the last few years, and raises new open problems. Results are mainly quoted, and the mephasis is on new notions and open problems. For more ...
متن کاملExpressiveness and Complexity Results for Strategic Reasoning
Abstract This paper presents a range of expressiveness and complexity results for the specification, computation, and verification of Nash equilibria in multi-player non-zero-sum concurrent games in which players have goals expressed as temporal logic formulae. Our results are based on a novel approach to the characterisation of equilibria in such games: a semantic characterisation based on win...
متن کامل